Mean internodal distance in regular and random multihop networks
نویسنده
چکیده
Multihop networks must pass messages between source and destination nodes via intermediate links and nodes. Assuming propagation delay is ignored, the mean amount of time the average message stays in a multihop network is directly proportional to the mean distance, in hops, between nodes. Thus, the aggregate link capacity of the network is also directly proportional to this "mean internodal distance". In addition the mean internodal distance is proportional to the average delay between sending and receiving a message as well as being inversely proportional to the channel efficiency of a network.1
منابع مشابه
Low mean internodal distance network topologies and simulated annealing
• Networks have been found through simulated annealing with mean internodal distances lower than any previously reported for a given number of nodes $N$ with a maximum of $p$ outgoing links per node. These networks form the closest known approximations to Moore networks. However, the improvements in mean internodal distance obtained are relatively small (a few percent) and this improvement decr...
متن کاملWeakly Versus Strongly Multihop Space-Division Optical Networks - Lightwave Technology, Journal of
Transparent multihop optical networks suffer from the accumulation from node to node of crosstalk and amplified spontaneous emission noise, which may severely degrade the quality of received signals. It is thus important to keep the number of intermediate hops as low as possible. This paper compares two single-wavelength cell-switching space-division optical networks that employ deflection rout...
متن کاملThroughput Analysis of Fading Sensor Networks with Regular and Random Topologies
We present closed-form expressions of the average link throughput for sensor networks with a slotted ALOHA MAC protocol in Rayleigh fading channels. We compare networks with three regular topologies in terms of throughput, transmit efficiency, and transport capacity. In particular, for square lattice networks, we present a sensitivity analysis of the maximum throughput and the optimum transmit ...
متن کاملOptimum Logical Topology for WDM Networks
This paper compares four network configurations for using as the logical topology in multihop wavelength division multiplexing (WDM) networks. The regular network configurations studied in this paper are ShuffleNet, de Bruijn graph, hypercube, and Manhattan street network. Instead of using the weight mean hop distance h̄ of node placement problem for comparing optimum logical topology, we introd...
متن کاملHypercube connected rings: a scalable and fault-tolerant logical topology for optical networks
A new, fault-tolerant, scalable, and, modular virtual topology for lightwave networks employing wavelength division multiplexing is proposed. The proposed architecture is based on hypercube connected ring structure that enjoys the rich topological properties of hypercube, but it also overcomes one of its drawback. In a hypercube, the nodal degree increases with the number of nodes. Hence, the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Communications
دوره 40 شماره
صفحات -
تاریخ انتشار 1992